The product of converse PDL and polymodal K
نویسنده
چکیده
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form F G such that F and G validate L1 and L2, respectively. This paper proves the decidability of the product of converse PDL and polymodal K. Decidability results for products of modal logics of knowledge as well as temporal logics and polymodal K are discussed. All those products form rather expressive but still decidable fragments of modal predicate logics. Based on the equivalence of polymodal K and the description logic ALC we shall discuss the obtained fragments, extend the expressive power a bit, and compare them with other modal description logics.
منابع مشابه
Eliminating "Converse" from Converse PDL
In this paper we show that it is possible to eliminate the converse operator from the propositional dynamic logic CPDL Converse PDL without compromising the soundness and completeness of inference for it Speci cally we present an encoding of CPDL formulae into PDL that eliminates the converse programs from a CPDL formula but adds enough information so as not to destroy its original meaning with...
متن کاملThe Taming of Converse: Reasoning about Two-way Computations
We consider variants o f propositional dynamic logic (PDL) augmented with the converse construct. Intuitively, the converse a of a program a is a programs whose semantics is to run a backwards. While PDL consists o f assertions about weakest preconditions, the converse construct enable us to make assertions about strongest postconditions. We investigate the interaction of converse with two cons...
متن کاملA Cut-Free ExpTime Tableau Decision Procedure for the Logic Extending Converse-PDL with Regular Inclusion Axioms
We give the first cut-free ExpTime (optimal) tableau decision procedure for the logic CPDLreg, which extends Converse-PDL with regular inclusion axioms characterized by finite automata. The logic CPDLreg is the combination of Converse-PDL and regular grammar logic with converse. Our tableau decision procedure uses global state caching and has been designed to increase efficiency and allow vario...
متن کاملConverse, Local Determinism, and Graded Nondeterminism in Propositional Dynamic Logics Converse, Local Determinism, and Graded Nondeterminism in Propositional Dynamic Logics
Recent work on Knowledge Representation has brought new interest to Propositional Dynamic Logics PDL s by pointing out a tight correspondence between these logics and logics for representing structured knowledge Description Logics TerminologicalLanguages Nevertheless this work has also made apparent the lack in the known PDL s of certain constructs needed to fully exploit the correspondence The...
متن کاملPDL with Intersection and Converse is 2EXP-complete
We study the complexity of satisfiability in the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Our main result is containment in 2EXP, which improves the previously known non-elementary upper bound and implies 2EXPcompleteness due to an existing lower bound for PDL with intersection. The proof proceeds by showing t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Comput.
دوره 10 شماره
صفحات -
تاریخ انتشار 2000